Matrices With Small Coherence Using $p$-Ary Block Codes

نویسندگان

  • Arash Amini
  • Vahid Montazerhodjat
  • Farrokh Marvasti
چکیده

In contrast to the vast amount of literature in random matrices in the field of compressed sensing, the subject of deterministic matrix design is at its early stages. Since these deterministic matrices are usually constructed using the polynomials in finite Galois fields, the number of rows (number of samples) is restricted to some specific integers such as prime powers. In this paper, besides extending a previous matrix design based on the binary BCH codes to the p-ary codes, we introduce matrices with wide variety of options for the number of rows. Simulation results demonstrate that these matrices perform almost as well as random matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New multilevel codes over GF(q)

In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...

متن کامل

Codes from incidence matrices and line graphs of Paley graphs

We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a prime power, and show that the codes are [ q(q−1) 4 , q − 1, q−1 2 ]2 or [ q(q−1) 4 , q, q−1 2 ]p for p odd. By finding PD-sets we show that for q > 9 the p-ary codes, for any p, can be used for permutation decoding for full error-correction. The binary code from the line graph of P (q) is shown to...

متن کامل

New inequalities for $$q$$ q -ary constant-weight codes

Using double counting, we prove Delsarte inequalities for qary codes and their improvements. Applying the same technique to q-ary constant-weight codes, we obtain new inequalities for q-ary constantweight codes.

متن کامل

4-Ary Codebook Design Using Reed-Muller Codes for MIMO Beamforming Systems

We design 4-ary codebooks using Reed Muller codes for multiple-input multiple-output (MIMO) beamforming systems. An upperbound on the maximum correlation magnitude metric of a 4-ary codebook is derived from the minimum Hamming distance of the corresponding binary linear block code. The 4-ary MIMO beamforming codebooks for the number of transmit antennas equal to 4, 8, 16, and 32 are tabulated. ...

متن کامل

Codes from incidence matrices of graphs

We examine the p-ary codes, for any prime p, from the row span over Fp of |V | × |E| incidence matrices of connected graphs Γ = (V,E), showing that certain properties of the codes can be directly derived from the parameters and properties of the graphs. Using the edge-connectivity of Γ (defined as the minimum number of edges whose removal renders Γ disconnected) we show that, subject to various...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2012